Iterative methods for solvingAx=b, GMRES/FOM versus QMR/BiCG

نویسنده

  • Jane Cullum
چکیده

We study the convergence of GMRES/FOM and QMR/BiCG methods for solving nonsymmetric Ax = b. We prove that given the results of a BiCG computation on Ax = b, we can obtain a matrix B with the same eigenvalues as A and a vector c such that the residual norms generated by a FOM computation on Bx = c are identical to those generated by the BiCG computations. Using a unitary equivalence for each of these methods, we obtain test problems where we can easily vary certain spectral properties of the matrices. We use these test problems to study the eeects of nonnormality on the convergence of GMRES and QMR, to study the eeects of eigenvalue outliers on the convergence of QMR, and to compare the convergence of restarted GMRES and QMR across a family of normal and nonnormal problems. Our GMRES tests on nonnormal test matrices indicate that nonnormality can have unexpected eeects upon the residual norm convergence, giving misleading indications of superior convergence when the error norms for GMRES are not signiicantly diierent from those for QMR. Our QMR tests indicate that the convergence of the QMR residual and error norms is innuenced predominantly by small and large eigenvalue outliers and by the character, real, complex, or nearly real, of the outliers and the other eigenvalues. In our comparison tests QMR outperformed GMRES(10) and GMRES(20) on both the normal and nonnormal test matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations

In this paper, we use the BiCG, BiCGSTAB methods as preconditioned techniques. Also we compare the preconditioned Krylov subspace methods such as GMRES, GMRES(m), QMR, BiCG, CGS, BiCGSTAB for solving linear systems arising from a class of fourth-order approximations for solving the elliptic partial differential equation Auxx + Buyy = f(x,y,u,ux,uy), where A and B are constants. Numerical result...

متن کامل

The Non-Symmetric s-Step Lanczos Algorithm: Derivation Of Efficient Recurrences And Synchronization-Reducing Variants Of BiCG And QMR

The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on dist...

متن کامل

Convergence analysis of the global FOM and GMRES methods for solving matrix equations $AXB=C$ with SPD coefficients

In this paper‎, ‎we study convergence behavior of the global FOM (Gl-FOM) and global GMRES (Gl-GMRES) methods for solving the matrix equation $AXB=C$ where $A$ and $B$ are symmetric positive definite (SPD)‎. ‎We present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎In particular‎, ‎the obtained upper...

متن کامل

FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning

A flexible version of the QMR algorithm is presented which allows for the use of a different preconditioner at each step of the algorithm. In particular, inexact solutions of the preconditioned equations are allowed, as well as the use of an (inner) iterative method as a preconditioner. Several theorems are presented relating the norm of the residual of the new method with the norm of the resid...

متن کامل

Krylov subspace iterative methods for nonsymmetric discrete ill-posed problems in image restoration

The BiCG and QMR methods are well-known Krylov subspace iterative methods for the solution of linear systems of equations with a large nonsymmetric, nonsingular matrix. However, little is known of the performance of these methods when they are applied to the computation of approximate solutions of linear systems of equations with a matrix of ill-determined rank. Such linear systems are known as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. Comput. Math.

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1996